Stability bounds for local Lagrangian interpolation
نویسندگان
چکیده
منابع مشابه
Strong exponent bounds for the local Rankin-Selberg convolution
Let $F$ be a non-Archimedean locally compact field. Let $sigma$ and $tau$ be finite-dimensional representations of the Weil-Deligne group of $F$. We give strong upper and lower bounds for the Artin and Swan exponents of $sigmaotimestau$ in terms of those of $sigma$ and $tau$. We give a different lower bound in terms of $sigmaotimeschecksigma$ and $tauotimeschecktau$. Using the Langlands...
متن کاملUPPER BOUNDS FOR FINITENESS OF GENERALIZED LOCAL COHOMOLOGY MODULES
Let $R$ be a commutative Noetherian ring with non-zero identity and $fa$ an ideal of $R$. Let $M$ be a finite $R$--module of finite projective dimension and $N$ an arbitrary finite $R$--module. We characterize the membership of the generalized local cohomology modules $lc^{i}_{fa}(M,N)$ in certain Serre subcategories of the category of modules from upper bounds. We define and study the properti...
متن کاملNonlinear Cable equation, Fractional differential equation, Radial point interpolation method, Meshless local Petrov – Galerkin, Stability analysis
The cable equation is one the most fundamental mathematical models in the neuroscience, which describes the electro-diffusion of ions in denderits. New findings indicate that the standard cable equation is inadequate for describing the process of electro-diffusion of ions. So, recently, the cable model has been modified based on the theory of fractional calculus. In this paper, the two dimensio...
متن کاملStrengthening Lagrangian Bounds for theMAX - SAT Problem
We propose an algorithm for the strengthening of the Generalized Set Covering formulation of the MAX-SAT Problem. Unlike the standard approach, our procedure does not rely on the solution of the linear relaxation to generate the cuts used to strengthen the formulation. On the contrary, it computes a La-grangian bound and uses the Lagrangian multipliers to guide the generation of cutting planes....
متن کاملLower complexity bounds for interpolation algorithms
We introduce and discuss a new computational model for Hermite–Lagrange interpolation by nonlinear classes of polynomial interpolants. We distinguish between an interpolation problem and an algorithm that solves it. Our model includes also coalescence phenomena and captures a large variety of known Lagrange-Hermite interpolation problems and algorithms. Like in traditional Hermite–Lagrange inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1988
ISSN: 0021-9045
DOI: 10.1016/0021-9045(88)90059-7